From SHOQ(D) Toward E-connections
نویسندگان
چکیده
In this paper, we propose a tableau-based technique for reasoning with various distributed DL knowledge bases. This technique can be applied both to DDLs and to new and relevant sublanguages of basic E-connections. Its main advantage is that it is straightforward to implement by extending the existing tableau-based algorithms, as witnessed by our implementation in the Pellet OWL reasoner.
منابع مشابه
Reasoning in the SHOQ(Dn) Description Logic
Description Logics (DLs) are of crucial importance to the development of the Semantic Web, where their role is to provide formal underpinnings and automated reasoning services for Semantic Web ontology languages such as DAML+OIL. In this paper we show how the description logic SHOQ(D), which has been designed to provide such services, can be extended with n-ary datatype predicates as well as da...
متن کاملDeciding SHOQ^cap Knowledge Base Consistency using Alternating Automata
We introduce an automata-based method for deciding the consistency of SHOQ⊓ knowledge bases. The presented algorithm decides knowledge base consistency in deterministic double exponential time for SHOQ⊓, but is in ExpTime if no role conjunctions occur in the input knowledge base. This shows that SHOQ is indeed ExpTimecomplete, which was, to the best of our knowledge, always conjectured but neve...
متن کاملExtending Datatype Support in Web Ontology Reasoning
The Semantic Web is a vision of the next generation Web, in which semantic markup will make Web resources more accessible to automatic processes. Description Logics (DLs) are of crucial importance to the development of the Semantic Web, where their role is to provide formal underpinnings and automated reasoning services for Semantic Web ontology languages such as DAML+OIL. In this paper, we sho...
متن کاملOntology Reasoning in the SHOQ(D) Description Logic
Ontologies are set to play a key rôle in the “Semantic Web” by providing a source of shared and precisely defined terms that can be used in descriptions of web resources. Reasoning over such descriptions will be essential if web resources are to be more accessible to automated processes. SHOQ(D) is an expressive description logic equipped with named individuals and concrete datatypes which has ...
متن کاملA Consequence-based Algebraic Calculus for SHOQ
In this paper, we present a novel consequence-based algorithm to perform subsumption reasoning in SHOQ, which support nominals and Qualified Cardinality Restrictions (QCRs). Our algorithm maps numerical restrictions imposed by QCRs or nominals to inequalities and determines the feasibility of inequality systems by means of Integer Linear Programming.
متن کامل